The automorphism group of a graph product with no SIL

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Automorphism Group of Commuting Graph of a Finite Group

Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and x, y ∈ X (x 6= y) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ∆(G). The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(∆(G)) is abelian if and only if ...

متن کامل

Automorphism group and diameter of a graph

Given a connected graph Γ of order n and diameter d, we establish a tight upper bound for the order of the automorphism group of Γ as a function of n and d, and determine the graphs for which the bound is attained.

متن کامل

Automorphism Group of the Derangement Graph

In this paper, we prove that the full automorphism group of the derangement graph Γn (n ≥ 3) is equal to (R(Sn) ⋊ Inn(Sn)) ⋊ Z2, where R(Sn) and Inn(Sn) are the right regular representation and the inner automorphism group of Sn respectively, and Z2 = 〈φ〉 with the mapping φ : σ φ = σ−1, ∀σ ∈ Sn. Moreover, all orbits on the edge set of Γn (n ≥ 3) are determined.

متن کامل

The Automorphism Group of a Product of Graphs

In a recent paper we showed that every connected graph can be written as a weak cartesian product of a family of indecomposable rooted graphs and that this decomposition is unique to within isomorphisms. Using this unique prime factorization theorem we prove that if a graph X can be written as a product of connected rooted graphs, which are pairwise relatively prime, then the automorphism group...

متن کامل

The automorphism group of a product of hypergraphs

Let A and B be sets. As usual, we denote by IA / and 9(A) the cardinality and the power set of A, respectively. For each e E .P(A X B) let e1 (resp. e’) be the set of first (resp. second) coordinates of elements of e. If e E 9(A), .yi E A, ai E A for i = l,..., n, then e, ,,,.,, Xfl]a ,,..., a,] is the set obtained by replacing xi by a, in e for each i = l,..., n (tf x 6 e, then e,[a] = e). If ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Illinois Journal of Mathematics

سال: 2010

ISSN: 0019-2082

DOI: 10.1215/ijm/1299679748